On inverse sampling without replacement

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Simple Inverse Sampling with Replacement

In this paper we derive some unbiased estimators of the population mean under simple inverse sampling with replacement, using the class of Hansen-Hurwitz and Horvitz-Thompson type estimators and the post-stratification approach. We also compare the efficiency of resulting estimators together with Murthy's estimator. We show that in despite of general belief, the strategy consisting of inverse s...

متن کامل

Without-Replacement Sampling for Stochastic Gradient Methods

Stochastic gradient methods for machine learning and optimization problems are usually analyzed assuming data points are sampled with replacement. In contrast, sampling without replacement is far less understood, yet in practice it is very common, often easier to implement, and usually performs better. In this paper, we provide competitive convergence guarantees for without-replacement sampling...

متن کامل

Weighted Sampling Without Replacement from Data Streams

Weighted sampling without replacement has proved to be a very important tool in designing new algorithms. Efraimidis and Spirakis (IPL 2006) presented an algorithm for weighted sampling without replacement from data streams. Their algorithm works under the assumption of precise computations over the interval [0, 1]. Cohen and Kaplan (VLDB 2008) used similar methods for their bottom-k sketches. ...

متن کامل

Accelerating weighted random sampling without replacement

Random sampling from discrete populations is one of the basic primitives in statistical computing. This article briefly introduces weighted and unweighted sampling with and without replacement. The case of weighted sampling without replacement appears to be most difficult to implement efficiently, which might be one reason why the R implementation performs slowly for large problem sizes. This p...

متن کامل

On Sampling without Replacement and Ok-corral Urn Models

In this work we discuss two urn models with general weight sequences (A,B) associated to them, A = (αn)n∈N andB = (βm)m∈N, generalizing two well known Pólya-Eggenberger urn models, namely the so-called sampling without replacement urn model and the OK Corral urn model. We derive simple explicit expressions for the distribution of the number of white balls, when all black have been drawn, and ob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistical Papers

سال: 2009

ISSN: 0932-5026,1613-9798

DOI: 10.1007/s00362-009-0209-9